A modifiction of the CSP algorithm for infinite languages
نویسنده
چکیده
Constraint Satisfaction Problem on finite sets is known to be NP-complete in general but certain restrictions on the constraint language can ensure tractability. It was proved [4, 18] that if a constraint language has a weak near unanimity polymorphism then the corresponding constraint satisfaction problem is tractable, otherwise it is NPcomplete. In the paper we present a modification of the algorithm from [18] that works in polynomial time even for infinite constraint languages.
منابع مشابه
توسعه روش SL با ترتیب KBO برای اثبات خودکار پایان‌پذیری سیستم بازنویسی ترم - مقاله برگزیده هفدهمین کنفرانس ملی انجمن کامپیوتر ایران
The term rewriting systems (TRSs) is an abstract model of functional languages. The termination proving of TRSs is necessary for confirming accuracy of functional languages. The semantic labeling (SL) is a complete method for proving termination. The semantic part of SL is given by a quasi-model of the rewrite rules. The most power of SL is related to infinite models that is difficult f...
متن کاملThe trim loss concentration in one-dimensional cutting stock problem (1D-CSP) by defining a virtual cost
Nowadays, One-Dimensional Cutting Stock Problem (1D-CSP) is used in many industrial processes and re-cently has been considered as one of the most important research topic. In this paper, a metaheuristic algo-rithm based on the Simulated Annealing (SA) method is represented to minimize the trim loss and also to fo-cus the trim loss on the minimum number of large objects. In this method, the 1D-...
متن کاملبهبود کارایی طبقه‌بندی‌کننده مبتنی بر نمایش تنک برای طبقه‌بندی سیگنالهای مغزی
In this paper, the problem of classification of motor imagery EEG signals using a sparse representation-based classifier is considered. Designing a powerful dictionary matrix, i.e. extracting proper features, is an important issue in such a classifier. Due to its high performance, the Common Spatial Patterns (CSP) algorithm is widely used for this purpose in the BCI systems. The main disadvanta...
متن کاملAn Unbounded Nondeterministic Model for CSP-like Languages
The main contribution of this paper is the introduction of unbounded nondeterminism into CSP-like languages with specification, which increases the expressive power of the specification language. This is achieved by extending the finite message set of such mixed languages to an infinite one. A denotational semantics and a refinement order are defined for such a language and the CSP constructors...
متن کاملNon-dichotomies in Constraint Satisfaction Complexity
We show that every computational decision problem is polynomialtime equivalent to a constraint satisfaction problem (CSP) with an infinite template. We also construct for every decision problem L an ω-categorical template Γ such that L reduces to CSP(Γ ) and CSP(Γ ) is in coNP (i.e., the class coNP with an oracle for L). CSPs with ω-categorical templates are of special interest, because the uni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018